Thermodynamic analysis and optimization of a geothermal Kalina cycle system using Artificial Bee Colony algorithm

In this paper, thermodynamic analysis is carried out for a geothermal Kalina cycle employed in Husavic power plant. Afterwards, the optimum operating conditions in which the cycle is at its best performance are calculated. In order to reach the optimum thermal and exergy efficiencies of the cycle, Artificial Bee Colony (ABC) algorithm, a new powerful multi-objective and multi-modal optimization algorithm, is conducted. Regarding the mechanism of ABC algorithm, convergence speed and precision of solutions have been remarkably improved when compared to those of GA, PSO and DE algorithms. Such a relative improvement is indicated by a limit parameter and declining probability of premature convergence. In this research, exergy efficiency including chemical and physical exergies and thermal efficiency are chosen as the objective functions of ABC algorithm where optimum values of the efficiencies for the Kalina cycle are found to be 48.18 and 20.36%, respectively, while the empirical thermal efficiency of the cycle is about 14%. At the optimum thermal and exergy efficiencies, total exergy destruction rates are respectively 4.17 and 3.48 MW. Finally, effects of the separator inlet pressure, temperature, basic ammonia mass fraction and mass flow rate on the first and second law efficiencies are investigated.     

基于遗传算法的大厂矿区地震定位研究

基于遗传算法对大厂矿区的地震进行重新定位。为验证该方法在大厂矿区的应用效果,首先对已知的5次人工爆破进行定位,得出平均定位水平误差在146m范围内(矿区台网定位水平误差为500m),进而对大厂矿区的81次ML1.0级以上地震进行重新定位,结果表明:大厂矿震主要呈北西向展布,且主要集中在大厂断裂右侧;较大地震均与大厂断裂呈平行状分布,推断其附近可能有隐伏断层存在;大厂矿区地震主要受北西向断层的影响,受北东向断层的影响不大。定位后震源平均深度为2.8km,最大深度6.5km,最小深度1.5km。     

An integrated supply chain production–distribution planning with stochastic demands

In this paper a three echelon supply chain with multiple distribution centers, production sites and suppliers is modeled. For this supply chain several commodities with defined items is produced. The model is categorized as a capacitated facility location model. The hierarchical approach is used to modeling and based on decision types the model is divided into two levels. The solution approach is based on the Lagrangian Relaxation approach, improved by an efficient heuristic to solve complex sub-problems. Computational results indicated that the proposed method yields high-quality solutions within a reasonable computational time for various real size problems.     

Identification of time‐delay Markov jump autoregressive exogenous systems with expectation‐maximization algorithm

This paper is concerned with the identification problem of the Markov jump autoregressive exogenous system with an unknown time delay. The considered problem is solved using the expectation‐maximization algorithm, which estimates the parameters of local models, Markov transition probabilities, and time delay simultaneously. A numerical example and a simulated continuous fermentation reactor example are given to illustrate the capability of the proposed method. It shows that the influences of time delay during identification can be overcome by the proposed algorithm effectively.     

From evaluation to learning: Some aspects of designing a cyber-university

Research is described on a system for web-assisted education and how it is used to deliver on-line drill questions, automatically suited to individual students. The system can store and display all of the various pieces of information used in a class-room (slides, examples, handouts, drill items) and give individualized drills to participating students. The system is built on the basic theme that it is for learning rather than evaluation.Experimental results shown here imply that both the item database and the item allocation methods are important and examples are given on how these need to be tuned for each course. Different item allocation methods are discussed and a method is proposed for comparing several such schemes. It is shown that students improve their knowledge while using the system. Classical statistical models which do not include learning, but are designed for mere evaluation, are therefore not applicable.A corollary of the openness and emphasis on learning is that the student is permitted to continue requesting drill items until the system reports a grade which is satisfactory to the student. An obvious resulting challenge is how such a grade should be computed so as to reflect actual knowledge at the time of computation, entice the student to continue and simultaneously be a clear indication for the student. To name a few methods, a grade can in principle be computed based on all available answers on a topic, on the last few answers or on answers up to a given number of attempts, but all of these have obvious problems.     

改进的Potrace提花织物图像矢量化算法

为了对提花织物图像进行矢量化,针对其颜色少、色块大的特点,提出了改进的Potrace图像矢量化算法。原始的Potrace算法只能实现对二值图像的矢量化,改进后的算法将位图中的色块逐个分解生成一个个的闭合路径,之后将这些闭合路径按照其各自分布拼接成树状结构并矢量化,最终生成一个完整的矢量图形。该算法在实际的应用中取得较好效果。     

Mathematical Modeling and Genetic Algorithm Optimization of Reactive Absorption of H2S

A rate‐based mathematical model was developed for the reactive absorption of H₂S in NaOH, with NaOCl or H₂O₂ as the chemical oxidant solutions in a packed column. A modified mass transfer coefficient in the gas phase was obtained by genetic algorithm and implemented in the model to correct the assumption of instantaneous reactions. The effects of different operating variables including the inlet H₂S concentration, inlet gas mass flux, initial NaOH, concentrations of the chemical oxidants in the scrubbing solutions, and liquid‐to‐gas ratio on the H₂S removal efficiency were studied. A genetic algorithm was employed to optimize the operating variables in order to obtain maximum removal efficiency of H₂S. The model results were in good agreement with the experimental data.     

Nonlinear adaptive noise-induced algorithm and its application in penetration signal

A nonlinear adaptive noise induced algorithm with nonlinear weights was proposed to extract rigid body deceleration during penetration events; it has 3rd-order nonlinear weight, which ensures deceleration curve is smooth everywhere (not only continuous) and avoids sharp points (crucial for targets detection). In addition, an autocorrelation algorithm was improved by applying moving window method to be compared with the proposed nonlinear adaptive algorithm. By calculating penetration depth and Power Spectrum Density (PSD) of 4 deceleration time series, we show that the nonlinear adaptive algorithm more effectively reduces noise in deceleration for striking velocities between 538 and 800 m/s compared with Adaptive Paйta Criterion, moving window autocorrelation and wavelet algorithms. It is further shown that the proposed adaptive algorithm is of the same order as the other 3 methods in terms of computational complexity.     

Degree-constrained minimum spanning tree problem with uncertain edge weights

Uncertainty theory has shown great advantages in solving many nondeterministic problems, one of which is the degree-constrained minimum spanning tree (DCMST) problem in uncertain networks. Based on different criteria for ranking uncertain variables, three types of DCMST models are proposed here: uncertain expected value DCMST model, uncertain α-DCMST model and uncertain most chance DCMST model. In this paper, we give their uncertainty distributions and fully characterize uncertain expected value DCMST and uncertain α-DCMST in uncertain networks. We also discover an equivalence relation between the uncertain α-DCMST of an uncertain network and the DCMST of the corresponding deterministic network. Finally, a related genetic algorithm is proposed here to solve the three models, and some numerical examples are provided to illustrate its effectiveness.